Rumely Domains with Atomic Constructible Boolean Algebra. An Effective Viewpoint

An Algebra of Boolean Processes

This work has been motivated by the study of the S=R models which allow to represent systems as a set of communicating state machines cooperating through a shared memory. We show that S=R models can be expressed in terms of a process algebra called Boolean SCCS which is a special case of Milner's SCCS, in the sense that the actions are elements of some boolean algebra. We deene for Boolean SCCS...

An atomic MV-effect algebra with non-atomic center

A set E equipped with a partial, commutative and associative operation ⊕, containing elements 0 and 1, in which the existence of a unique inverse element x′ to any x ∈ E is guaranteed, and a⊕ 1 is admitted only if a = 0 is well known as effect algebra. Effect algebras were introduced by Foulis and Bennet [3] and simultaneously by Kôpka and Chovanec [7] as D-posets. An effect algebra equipped wi...

Algebraically Constructible Functions: Real Algebra and Topology

Algebraically constructible functions connect real algebra with the topology of algebraic sets. In this survey we present some history, definitions, properties, and algebraic characterizations of algebraically constructible functions, and a description of local obstructions for a topological space to be homeomorphic to a real algebraic set. More than three decades ago Sullivan proved that the l...

The Extension of an Arbitrary Boolean Algebra to an Implicative Boolean Algebra

Solving Sudoku with Boolean Algebra

Sudoku is a very popular puzzle which consists of placing several numbers in a squared grid according to some simple rules. In this paper, we present a Sudoku solving technique named Boolean Sudoku Solver (BSS) using only simple Boolean algebras. Use of Boolean algebra increases the execution speed of the Sudoku solver. Simulation results show that our method returns the solution of the Sudoku ...